Search results for "binary [neutron star]"
showing 10 items of 544 documents
Modeling Networks of Probabilistic Memristors in SPICE
2021
Efficient simulation of stochastic memristors and their networks requires novel modeling approaches. Utilizing a master equation to find occupation probabilities of network states is a recent major departure from typical memristor modeling [Chaos, solitons fractals 142, 110385 (2021)]. In the present article we show how to implement such master equations in SPICE – a general purpose circuit simulation program. In the case studies we simulate the dynamics of acdriven probabilistic binary and multi-state memristors, and dc-driven networks of probabilistic binary and multi-state memristors. Our SPICE results are in perfect agreement with known analytical solutions. Examples of LTspice code are…
On the Measurement and Prediction of the Out-of-Plane Displacement Surrounding Cold-Expanded Holes
2010
Experimental measurements of the out-of-plane displacement surrounding cold-expanded holes in a 6082-T6 aluminum alloy were made with a 3D optical scanner using the technique of the encoded light-pattern projection in white light. The measured surface profiles have shown the thickness discontinuity along the hole edge due to the effect of the split in the sleeve. An analytical–numerical solution of the out-of-plane displacement is presented based on existing analytical models. Thus, the results given by the analytical model were then compared with the experimental data and with a finite element (FE) model that simulates the cold-expansion process. The location of the elastic–plastic boundar…
On Obtaining Classification Confidence, Ranked Predictions and AUC with Tsetlin Machines
2020
Tsetlin machines (TMs) are a promising approach to machine learning that uses Tsetlin Automata to produce patterns in propositional logic, leading to binary (hard) classifications. In many applications, however, one needs to know the confidence of classifications, e.g. to facilitate risk management. In this paper, we propose a novel scheme for measuring TM confidence based on the logistic function, calculated from the propositional logic patterns that match the input. We then use this scheme to trade off precision against recall, producing area under receiver operating characteristic curves (AUC) for TMs. Empirically, using four real-world datasets, we show that AUC is a more sensitive meas…
1,3,5-triisopropylbenzene diffusion in polystyrene solutions
1996
Self-diffusion coefficients of 1,3,5-triisopropylbenzene (TIB) in binary solutions with polystyrene and ternary mixtures comprised of TIB, toluene, and polystyrene have been measured by static gradient nuclear magnetic resonance (SG-NMR) techniques. These data, as well as mutual-diffusion coefficient data measured by capillary column inverse gas chromatography (CCIGC), have been analyzed here with the Vrentas-Duda free-volume diffusion model. Although both binary and ternary diffusion coefficient data can be accurately correlated with the model, the results contradict those of an earlier investigation, which suggested that TIB diffuses as a single unit in polystyrene solutions. The new data…
Output Feedback Control of Discrete Impulsive Switched Systems with State Delays and Missing Measurements
2013
Published version of an article in the journal: Mathematical Problems in Engineering. Also available from the publisher at: http://dx.doi.org/10.1155/2013/283426 Open Access This paper is concerned with the problem of dynamic output feedback (DOF) control for a class of uncertain discrete impulsive switched systems with state delays and missing measurements. The missing measurements are modeled as a binary switch sequence specified by a conditional probability distribution. The problem addressed is to design an output feedback controller such that for all admissible uncertainties, the closed-loop system is exponentially stable in mean square sense. By using the average dwell time approach a…
On the product of balanced sequences
2011
The product w = u ⊗ v of two sequences u and v is a naturally defined sequence on the alphabet of pairs of symbols. Here, we study when the product w of two balanced sequences u,v is balanced too. In the case u and v are binary sequences, we prove, as a main result, that, if such a product w is balanced and deg ( w ) = 4, then w is an ultimately periodic sequence of a very special form. The case of arbitrary alphabets is approached in the last section. The partial results obtained and the problems proposed show the interest of the notion of product in the study of balanced sequences.
Silhouette encoding and synthesis using elliptic Fourier descriptors, and applications to videoconferencing
2004
Abstract This paper investigates the use of elliptic Fourier descriptors as a shape descriptor for encoding the silhouette of a person. Shape descriptors are here used for predicting the shape of silhouettes in missing frames within a sequence. This prediction scheme is applied to the case of generating in-between images in a low frame rate videoconferencing system, where the reconstructed silhouette is used as a binary mask for reducing the computational time for the frame reconstruction.
Binary Patterns in Infinite Binary Words
2002
In this paper we study the set P(w) of binary patterns that can occur in one infinite binary word w, comparing it with the set F(w) of factors of the word. Since the set P(w) can be considered as an extension of the set F(w), we first investigate how large is such extension, by introducing the parameter ?(w) that corresponds to the cardinality of the difference set P(w) \ F(w). Some non trivial results about such parameter are obtained in the case of the Thue-Morse and the Fibonacci words. Since, in most cases, the parameter ?(w) is infinite, we introduce the pattern complexity of w, which corresponds to the complexity of the language P(w). As a main result, we prove that there exist infini…
Words and Patterns
2002
In this paper some new ideas, problems and results on patterns are proposed. In particular, motivated by questions concerning avoidability, we first study the set of binary patterns that can occur in one infinite binary word, comparing it with the set of factors of the word. This suggests a classification of infinite words in terms of the "difference" between the set of its patterns and the set of its factors. The fact that each factor in an infinite word can give rise to several distinct patterns leads to study the set of patterns of a single finite word. This set, endowed with a natural order relation, defines a poset: we investigate the relationships between the structure of such a poset…